Ics 691: Advanced Data Structures Lecture 1 2.1 Aggregate Method
نویسندگان
چکیده
Amortized analysis is a method of analyzing algorithms that can help us determine an upper bound on the complexity of an algorithm. This is particular useful when analyzing operations on data structures, when they they involve slow, rarely occurring operations and fast, more common operations. With this disparity between each operations’ complexity, it is difficult to get a tight bound on the overall complexity of a sequence of operations using worst-case analysis. Amortized analysis provides us with a way of averaging the slow and fast operations together to obtain a tight upper bound on the overall algorithm runtime.
منابع مشابه
Ics 691: Advanced Data Structures Lecture 2 2 Searching a List 2.1 Static Structure
In the last lecture we discussed amortized analysis and looked at the 3 methods: aggregate, accounting, and potential. We used these 3 methods to show that the amortized complexity of the binary counter problem is O(n). Finally, we applied amortized analysis to the problem of inserting data into dynamic arrays, showing that inserting n objects has an amortized cost of O(n), despite the worst-ca...
متن کاملAdvanced Data Structures 2 Introduction 2.1 Dynamic Trees Problem 3 Sleator and Tarjan's St Trees [1] [2]
The problem of maintaining a forest where edge insertions and deletions are allowed is called the dynamic trees problem. Efficient solution to this problem have numerous applications, particularly in dynamic graphs. Several data structures which supports dynamic trees problem in logarithmic time have been proposed. In these lecture we will see two such data structures, the first is ST-tress pro...
متن کاملIndexed Captioned Searchable Videos: A Learning Companion for STEM Coursework
Videos of classroom lectures have proven to be a popular and versatile learning resource. A key shortcoming of the lecture video format is accessing the content of interest hidden in a video. This work meets this challenge with an advanced video framework featuring topical indexing, search, and captioning (ICS videos). Standard optical character recognition (OCR) technology was enhanced with im...
متن کامل2 Finishing the Description of Fusion Trees 2.1 Motivation 2.2 the Problem -fixed-universe Successor 2.3 Overview of Fusion Trees
More generally, the goal of fusion trees is to support the operations insert(x), delete(x), successor(x) and predecessor(x) in o(lgn) time on a transdichotomous RAM. The transdichotomous RAM model of computation was intrdouced in Lecture 2 (Feb. 12, 2003). The data-structure problem defined by these four operations is called the fixed-universe successor problem which was introduced in Lecture 1...
متن کامل